Fully symbolic TCTL model checking for complete and incomplete real-time systems
نویسندگان
چکیده
منابع مشابه
Fully symbolic TCTL model checking for complete and incomplete real-time systems
In this paper we introduce a new formal model, called finite state machines with time (FSMT), to represent real-time systems. We present a model checking algorithm for FSMTs, which works on fully symbolic state sets containing both the clock values and the state variables. Besides complete networks of FSMTs our algorithm can verify incomplete real-time systems in form of incomplete FSMTs, and i...
متن کاملFully Symbolic Model Checking for Incomplete Systems of Timed Automata
In this paper we present a fully symbolic backward model checking algorithm able to prove unrealizability for incomplete timed systems, i.e. the algorithm is able to prove that a (safety) property is violated regardless of the implementation of unknown components in the system. The algorithm works on a symbolic model for timed systems, called finite state machine with time (FSMT), and makes use...
متن کاملSymbolic Model Checking for Real-time Systems
We describe nite-state programs over real-numbered time in a guardedcommand language with real-valued clocks or, equivalently, as nite automata with real-valued clocks. Model checking answers the question which states of a real-time program satisfy a branching-time speci cation (given in an extension of CTL with clock variables). We develop an algorithm that computes this set of states symbolic...
متن کاملSymbolic Model Checking of Real-Time Systems
We present a new real-time temporal logic for the specification and verification of discrete quantitative temporal properties. This logic is an extension of the well-known logic CTL. Its semantics is defined on discrete time transition systems which are in turn interpreted in an abstract manner instead of the usual stuttering interpretation. Hence, our approach directly supports abstractions of...
متن کاملCompositional and Symbolic Model-Checking of Real-Time Systems
In this paper, we present symbolic and compositional techniques to avoid state explosion problems in model-checking for networks of timed automata. The symbolic technique is based on partitioning the inherently in nite state-space of timed automata in terms of simple constraints over the clocks variables instead of into regions. This allows the partitioning to take into account the particular s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2015
ISSN: 0167-6423
DOI: 10.1016/j.scico.2015.08.002